Search results for "Nash equilibrium"
showing 10 items of 58 documents
A Sequential Game Approach for Computation-Offloading in an UAV Network
2017
International audience; Small drones are currently emerging as versatile nascent technology that can be used in exploration and surveillance missions. However, most of the underlying applications require very often complex and time-consuming calculations. Although, the limited resources available onboard the small drones, their mobility, the computation delays and energy consumption make the operation of these applications very challenging. Nevertheless, computation-offloading solutions provide feasible resolves to mitigate the issues facing these constrained devices. In this context, we address in this paper the problem of offloading highly intensive computation tasks, performed by a fleet…
Sampled Fictitious Play on Networks
2019
We formulate and solve the problem of optimizing the structure of an information propagation network between multiple agents. In a given space of interests (e.g., information on certain targets), each agent is defined by a vector of their desirable information, called filter, and a vector of available information, called source. The agents seek to build a directed network that maximizes the value of the desirable source-information that reaches each agent having been filtered en route, less the expense that each agent incurs in filtering any information of no interest to them. We frame this optimization problem as a game of common interest, where the Nash equilibria can be attained as limit…
Non-convex power allocation games in MIMO cognitive radio networks
2013
Consideramos un escenario de reparto del espectro, basado en la detección, en una red de radio cognitiva MIMO donde el objetivo general es maximizar el rendimiento total de cada usuario de radio cognitiva optimizando conjuntamente la operación de detección y la asignación de potencia en todos los canales, bajo una restricción de interferencia para los usuarios primarios. Los problemas de optimización resultantes conducen a un juego no convexo, que presenta un nuevo desafío a la hora de analizar los equilibrios de este juego. Con el fin de hacer frente a la no convexidad del juego, utilizamos un nuevo concepto relajado de equilibrio, el equilibrio cuasi-Nash (QNE). Se demuestran las condicio…
Analysing Incentive Strategies to Promote Participation in Crowdsourcing Systems
2016
In this paper, we define two strategies for crowdsourcing systems to encourage users to participate at a cost that is close to the optimal cost for the system. In the scenario considered, the system has temporal constraints and potential participants have dynamic behaviors related to the expected rewards (i.e., users’ expected rewards in exchange of their contributions change over time). We propose and evaluate two types of strategies that promote participation of users through monetary rewards that can change as time passes in order to adapt them to the population dynamic behaviors.
On Capturing Rent from a Non-Renewable Resource International Monopoly: A Dynamic Game Approach
2005
In this paper we model the case of an international non-renewable resource monopolist as a dynamic game between a monopolist and n importing countries governments, and we investigate whether a tariff on resource imports can be advantageous for the consumers of the importing countries when the monopolist sets the price and the importing countries governments act in a non-cooperative way. We find that a tariff is advantageous for the consumers even when there is not commitment to the trade policy although the part of the rent that can be reaped by the importing countries decreases substantially with the number of importing countries. The optimality of the tariff in our dynamic game is explain…
Non-convex distributed power allocation games in cognitive radio networks
2013
In this thesis, we explore interweave communication systems in cognitive radio networks where the overall objective is to maximize the sum-rate of each cognitive radio user by optimizing jointly both the detection operation based on sensing and the power allocation across channels, taking into account the influence of the sensing accuracy and the interference limitation to the primary users. The optimization problem is addressed in single and multiuser cognitive radio networks for both single-input single-output and multi-input multi-output channels. Firstly, we study the resource allocation optimization problem for single-input single-output single user cognitive radio networks, wherein th…
Collusion constrained equilibrium
2018
We study collusion within groups in non-cooperative games. The primitives are the preferences of the players, their assignment to non-overlapping groups and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives that are suboptimal for the group in certain razor's edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained e…
On the Coincidence of the Feedback Nash and Stackelberg Equilibria in Economic Applications of Differential Games
2002
In this paper the scope of the applicability of the Stackelberg equilibrium concept in differential games is investigated. Firstly, conditions for obtaining the coincidence between the Stackelberg and Nash equilibria are defined in terms of the instantaneous pay-off function and the state equation of the game. Secondly, it is showed that for a class of differential games with state-interdependence both equilibria are identical independently of the player being the leader of the game. A survey of different economic models shows that this coincidence is going to occur for a good number of economic applications of differential games. This result appears because of the continuous-time setting i…
Computational Complexity and Communication: Coordination in Two-Player Games
2002
The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…
The erosion of personal norms and cognitive dissonance
2016
ABSTRACTIn this article, we study how personal norms and behaviour interact and evolve when agents try to reduce cognitive dissonance, and how this dynamic relates to Nash equilibrium. We find that in long run, agents play, and norms prescribe, Nash equilibrium in material payoffs (in the absence of norms). Our model captures two main facts: (i) norms erode along the play of the game; (ii) the erosion of norms depends on the set of possible economic choices, so that the policy maker can potentially influence them.